Model Checking Process Scheduling over Multi-core Computer System with MSVL
نویسندگان
چکیده
To solve the problem that software testing cannot meet the verification needs of process scheduling over multi-core computer system, a model checking approach with MSVL is adapted to verify the correctness of process scheduling. Firstly, the grammar of MSVL is briefly introduced; further, a general model supporting the most commonly used scheduling algorithms for multi-core computer is formalized by MSVL program; finally, as a case study, the safeness of the processes scheduler with the earliest deadline first(EDF) scheduling algorithm over a 2-core CPU is verified with MSV toolkit, which indicates the proposed approach can effectively solve the verification problems of process scheduling over multi-core CPU.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملModel checking Petri nets with MSVL
This paper presents three translations from Petri nets to Modeling, Simulation and Verification Language (MSVL) programs. Each translation is directed by one of the three semantics of Petri nets, namely interleaving, concurrency and max-concurrency. Further, for each translation, an equivalence relation between Petri nets and generated MSVL programs is proved. As a result, the supporting tool M...
متن کاملModel Checking MSVL Programs Based on Dynamic Symbolic Execution
In this paper, we propose a DSE based model checking approach (DSE-MC) for verifying programs written in Modelling, Simulation and Verification Language (MSVL) [1,3]. For doing so, we adopt a DSE method to execute an MSVL program to generate a symbolic execution tree (SEtree) which is used as the abstract model of the program. Further, a property to be verified is specified by a Propositional P...
متن کاملUnified Bounded Model Checking for MSVL
This paper presents Unified Bounded Model Checking (UBMC) for the verification of an infinite state system described with Modeling, Simulation and Verification Language (MSVL) which is an executable subset of Projection Temporal Logic (PTL). The desired property is specified by a Propositional PTL (PPTL) formula. We present the bounded semantics of PPTL and the approach to implementing UBMC. A ...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کامل